A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
نویسندگان
چکیده
منابع مشابه
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
This work deals with a class of problems under interval data uncertainty, namely interval robusthard problems, composed of interval data min-max regret generalizations of classical NP-hard combinatorial problems modeled as 0-1 integer linear programming problems. These problems are more challenging than other interval data min-max regret problems, as solely computing the cost of any feasible so...
متن کاملComputing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
In this chapter we discuss a wide class of combinatorial optimization problems with a linear sum and a bottleneck cost function. We first investigate the case when the weights in the problem are modeled as closed intervals. We show how the notion of optimality can be extended by using a concept of a deviation interval. In order to choose a solution we adopt a robust approach. We seek a solution...
متن کاملMin-max and min-max regret versions of combinatorial optimization problems: A survey
Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, min cut, min s-t cut, knapsack. Since most of these problems are NP -hard, we...
متن کاملMin-max and min-max regret versions of some combinatorial optimization problems: a survey
Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path, spanning tree, assignment, cut, s-t cut, knapsack. Since most of these problems are NP-hard, we also inv...
متن کاملApproximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a constant number of scenarios, we establish fully polynomial-time approximation schemes for the min-max versions of these problems, using relationships between multi-objective and min-max optimization. Us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2017
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.12.010